The Uniformization Process of the Fast Congestion Notification (FN)

نویسندگان

  • Mohammed M. Kadhum
  • Suhaidi Hassan
چکیده

Fast Congestion Notification (FN) is one of the proactive queue management mechanisms that practices congestion avoidance to help avoid the beginning of congestion by marking/dropping packets before the router’s queue gets full; and exercises congestion control, when congestion avoidance fails, by increasing the rate of packet marking/dropping. Technically, FN avoids the queue overflows by controlling the instantaneous queue size below the optimal queue size, and control congestion by keeping the average arrival rate close to the outgoing link capacity. Upon arrival of each packet, FN uses the instantaneous queue size and the average arrival rate to calculate the packet marking/dropping probability. FN marks/drops packets at fairly regular intervals to avoid long intermarking intervals and clustered packet marks/drops. Too many marked/dropped packets close together can cause global synchronization, and also too long packet intermarking times between marked/dropped packets can cause large queue sizes and congestion. This paper shows how FN controls the queue size, avoids congestion, and reduces global synchronization by uniformizing marked/dropped

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Drop Activation Function of the Fast Congestion Notification (FN) Mechanism

Fast Congestion Notification (FN) one of the proactive queue management mechanisms that practices congestion avoidance to help avoid the beginning of congestion by marking/dropping packets before the router’s queue gets full; and exercises congestion control, when congestion avoidance fails, by increasing the rate of packet marking/dropping. Upon arrival of each packet, FN uses the instantaneou...

متن کامل

A Report on Some Recent Developments in TCP Congestion Control

This paper discusses several changes to TCP’s congestion control, either proposed or in progress. The changes to TCP include a Limited Transmit mechanism for transmitting new packets on the receipt of one or two duplicate acknowledgements, and a SACK-based mechanism for detecting and responding to unnecessary Fast Retransmits or Retransmit Timeouts. These changes to TCP are designed to avoid un...

متن کامل

Congestion Control Approaches Applied to Wireless Sensor Networks: A Survey

Wireless Sensor Networks (WSNs) are a specific category of wireless ad-hoc networks where their performance is highly affected by application, life time, storage capacity, processing power, topology changes, the communication medium and bandwidth. These limitations necessitate an effective data transport control in WSNs considering quality of service, energy efficiency, and congestion control. ...

متن کامل

VRED: An improvement over RED algorithm by using queue length growth velocity

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

متن کامل

Fast and Strong Control of Congestion-Making Traffic

In case that malicious or selfish user congests network, the traditional congestion control schemes such as ECN (Explicit Congestion Notification) in TCP protocol could not control the pernicious congestion so perfectly as they protect normal traffic. In this paper, we propose a strong congestion-making traffic control scheme, which is capable of preventing malicious or selfish user from conges...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0909.1372  شماره 

صفحات  -

تاریخ انتشار 2009